UNIVERSITY OF WISCONSIN-MADISON COMPUTER SCIENCES DEPARTMENT Computational aspects of polynomial interpolation in several variables
نویسندگان
چکیده
The pair 〈Θ, P 〉 of a pointset Θ ⊂ IR and a polynomial space P on IR is correct if the restriction map P → IR : p 7→ p|Θ is invertible, i.e., if there is, for any f defined on Θ, a unique p ∈ P which matches f on Θ. We discuss here a particular assignment Θ 7→ ΠΘ, introduced in [3], for which 〈Θ,ΠΘ〉 is always correct, and provide an algorithm for the contruction of a basis for ΠΘ which is related to Gauss elimination applied to the Vandermonde matrix (θα)θ∈Θ,α∈ZZd+ for Θ. We also discuss some attractive properties of the above assignment and algorithmic details of the algorithm, and present some bivariate examples. AMS (MOS) Subject Classifications: primary 41A05, 41A10, 41A63, 65D05, 65D15 secondary 15A12
منابع مشابه
UNIVERSITY OF WISCONSIN-MADISON COMPUTER SCIENCES DEPARTMENT Polynomial ideals and multivariate splines
The well-established theory of multivariate polynomial ideals (over C) was found in recent years to be important for the investigation of several problems in multivariate approximation. In this note we draw connections between the validity of spectral synthesis in the space of all multivariate sequences and questions in multivariate splines on uniform meshes. AMS (MOS) Subject Classifications: ...
متن کاملThe effects of plasma-processing conditions on the morphology of adherent human blood platelets
adherent human blood platelets R. Murugesan, E. Hanley, R. M. Albrecht, J. A. Oliver, J. A. Heintz, J. L. Lauer, and J. L. Shohet Plasma Processing and Technology Laboratory and Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, Wisconsin 53706, USA Department of Animal Sciences, University of Wisconsin-Madison, Madison, Wisconsin 53706, USA Department ...
متن کاملComplexity Classification of the Eight-Vertex Model
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is explicit. For tractability, we find some new classes of problems computable in polynomial time. For #P-hardness, we employ Möbius transformations to prove ...
متن کاملEndarterectomy in Patients With Prior Cognitive Decline
∗Department of Neurological Surgery, University of Wisconsin School of Medicine and Public Health, Madison, Wisconsin; ‡Wisconsin Surgical Outcomes Center Research Program, Department of Surgery, University of Wisconsin School of Medicine and Public Health, Madison, Wisconsin; §Department of Medicine, Cardiovascular Medicine Division, University of Wisconsin School of Medicine and Public Health...
متن کاملUNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES On the error in multivariate polynomial interpolation
Simple proofs are provided for two properties of a new multivariate polynomial interpolation scheme, due to Amos Ron and the author, and a formula for the interpolation error is derived and discussed. AMS (MOS) Subject Classifications: 41A63, 41A05; 41A10 Author’s affiliation and address: Center for the Mathematical Sciences University of Wisconsin-Madison 610 Walnut St. Madison WI 53705 1 supp...
متن کامل